简体版 繁體版 English
로그인 회원가입

error distance 예문

예문모바일

  • One class of approximate algorithms takes as input the error distance, \ epsilon, and forms a data structure that can be stored efficiently ( low space complexity ) and that returns the ( 1 + \ epsilon )-approximate nearest neighbor quickly ( low time complexity ).